Identification betweenStephania tetrandraS. Moore andStephania cepharanthaHayata by CWT–FTIR–RBFNN

Underhill Moore

Very few Moore Graphs

We prove here a well known result in graph theory, originally proved by Hoffman and Singleton, that any non-trivial Moore graph of diameter 2 is regular of degree k = 2, 3, 7 or 57. The existence (and uniqueness) of these graphs is known for k = 2, 3, 7 while it is still an open problem if there is a moore graph of degree 57 or not.

String Matching Rules Used by Variants of Boyer-moore Algorithm

String matching problem is widely studied problem in computer science, mainly due to its large applications used in various fields. In this regards many string matching algorithms have been proposed. Boyer-Moore is most popular algorithm. Hence, maximum variants are proposed from Boyer-Moore (BM) algorithm. This paper addresses the variant of Boyer-Moore algorithm for finding the occurrences of...

Multipartite Moore Digraphs

We derive some Moore-like bounds for multipartite digraphs, which extend those of bipartite digraphs, assuming that every vertex of a given partite set is adjacent to the same number of vertices (δ) in each of the other independent sets. We determine when a Moore multipartite digraph is weakly distanceregular. Within this framework, some necessary conditions for the existence of a Moore r-parti...

Justin Tatch Moore

This note gives a “Zorn’s Lemma” style proof that any two bases in a vector space have the same cardinality. One of the most fundamental notions in linear algebra is that of a basis: A subset B of a vector space V is a basis if every element of V is a unique linear combination of elements of B. The following theorem of Georg Hamel expresses one of the most important aspects of this definition. ...